System and method for generating pixel values for pixels in an image using strictly deterministic methodologies for generating sample points

ABSTRACT

A computer graphics system generates pixel values for pixels in an image of objects in a scene, using strictly-deterministic low-discrepancy sequences, illustratively Halton sequences, as sample points for evaluating integrals which are used to simulate a number of computer graphic techniques. The computer graphics system uses the low-discrepancy sequence to ensure that the sample points are evenly distributed over a respective region or time interval, thereby reducing error in the image which can result from clumping of such sample points which can occur in the Monte Carlo technique. In particular, the invention facilitates the generation of images of improved quality when using the same number of sample points at the same computational cost as in the Monte Carlo technique.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application for U.S. patent is a continuation of, and claims the priority of, U.S. patent application Ser. No. 11/450,130 filed Jun. 8, 2006 now U.S. Pat. No. 7,479,962, which is a continuation of U.S. patent application Ser. No. 10/299,733 filed Nov. 18, 2002 (issued as U.S. Pat. No. 7,071,938 on Jul. 4, 2006), which is a divisional of U.S. patent application Ser. No. 08/880,418 filed Jun. 23, 1997 (issued as U.S. Pat. No. 6,529,193 on Mar. 4, 2003), which claims priority from Provisional Application 60/022,011 filed Jun. 25, 1996, each of which is incorporated herein by reference as if set forth in its entirety herein.

INCORPORATION BY REFERENCE

Martin Grabenstein And Rolf Herken, “A Comparison Of Strictly Deterministic With (Pseudo) Random Sampling Methods In Computer Graphics,” an unpublished paper attached hereto as an appendix, incorporated herein by reference.

FIELD OF THE INVENTION

The invention relates generally to the field of computer graphics, and more particularly to systems and methods for generating pixel values for pixels in the image.

BACKGROUND OF THE INVENTION

In computer graphics, a computer is used to generate digital data that represents the projection of surfaces of objects in, for example, a three-dimensional scene, illuminated by one or more light sources, onto a two-dimensional image plane, to simulate the recording of the scene by, for example, a camera. The camera may include a lens for projecting the image of the scene onto the image plane, or it may comprise a pinhole camera in which case no lens is used. The two dimensional image is in the form of an array of picture elements (which are variable termed “pixels” or “pels”), and the digital data generated for each pixel represents the color and luminance of the scene as projected onto the image plane at the point of the respective pixel in the image plane. The surfaces of the objects may have any of a number of characteristics, including shape, color, secularity, texture, and so forth, which are preferably rends in the image as closely as possible, to provide a realistic-looking image.

Generally, the contributions of the light reflected from the various points in the scene to the pixel value representing the color and intensity of a particular pixel are expressed in the form of the one or more integrals of relatively complicated functions. Since the integrals used in computer graphics generally will not have a closed-form solution, numerical methods must be used to evaluate them and thereby generate the pixel value. Typically, a conventional “Monte Carlo” method has been used in computer graphics to numerically evaluate the integrals. Generally, in the Monte Carlo method, to evaluate an integral

$\begin{matrix} {{{< f >}\; = {\int_{0}^{1}{{f(x)}\ {\mathbb{d}x}}}},} & (1) \end{matrix}$ where f(x) is a real function on the real numerical interval from zero to 1, inclusive, first a number “N” statistically-independent random numbers x₁, i=1, . . . , N, are generated over the interval. The random numbers x, are used as sample points for which sample values f(x_(i)) are generated for the function f(x), and an estimate f for the integral is generated as

$\begin{matrix} {{< f >}\; = {\overset{\_}{f} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{{f\left( x_{i} \right)}.}}}}} & (2) \end{matrix}$ As the number of random numbers used in generating the sample points f(x_(i)) increases, the value of the estimate f will converge toward the actual value of the integral <f>. Generally, the distribution of estimate values that will be generated for various values of “N,” that is, for various numbers of samples, of being normal distributed around the actual value with a standard deviation σ which can be estimated by

$\begin{matrix} {{\sigma = \sqrt{\frac{1}{N - 1}\left( {\overset{\_}{f^{2}} - {\overset{\_}{f}}^{2}} \right)}},} & (3) \end{matrix}$ if the values x_(i) used to generate the sample values f(x_(i)) are statistically independent, that is, if the values x_(i) are truly generated at random.

Generally, it has been believed that random methodologies like the Monte Carlo method are necessary to ensure that undesirable artifacts, such as Moiré patterns and aliasing and the like, which are not in the scene, will not be generated in the generated image. However, several problems arise from use of the Monte Carlo method in computer graphics. First, since the sample points x, used in the Monte Carlo method are randomly distributed they may not be generally evenly distributed across the interval, but instead may clump in various regions over the interval over which the integral is to be evaluated. Accordingly, depending on the set of random numbers which are generated, in the Monte Carlo method for significant portions of the interval there may be no sample points x_(i) for which sample values f(x_(i)) are generated. In that case, the error can become quite large. In the context of generating a pixel value in computer graphics, the pixel value that is actually generated using the Monte Carlo method may not reflect some elements which might otherwise be reflected if the sample points x_(i) were guaranteed to be generally evenly distributed over the interval. This problem can be alleviated somewhat by dividing the interval into a plurality of sub-intervals, but it is generally difficult to determine a priori the number of sub-intervals into which the interval should be divided, and, in addition, in a multi-dimensional integration region (which would actually be used in computer graphics, instead of the one-dimensional interval described here) the partitioning of the region into sub-regions of equal size can be quite complicated.

In addition, since the method makes use of random numbers, the error | f−<f>| (where |x| represents the absolute value of the value “x”) between the estimate value f and actual value <f> is probabilistic, and, since the error values for various values of “N” are normal distributed around the actual value <f>, only sixty-eight percent of the estimate values f that might be generated are guaranteed to lie within one standard deviation of the actual value <f>.

Furthermore, as is clear from equation (3), the standard deviation σ decreases with increasing numbers of samples N, proportional to the reciprocal of square root of “N” (that is, 1/√{square root over (N)}). Thus, if it is desired to reduce the statistical error by a factor of two, it will be necessary to increase the number of samples N by a factor of four, which, in turn, increases the computational load that is required to generate the pixel values, for each of the numerous pixels in the image.

Additionally, since the Monte Carlo method requires random numbers, an efficient mechanism for generating random numbers is needed. Generally, digital computers are provided with so-called “random number” generators, which are computer programs which can be processed to generate a set of numbers that are approximately random. Since the random number generators use deterministic techniques, the numbers that are generated are not truly random. However, the property that subsequent random number from a random number generator are statistically independent should be maintained by deterministic implementations of pseudo-random numbers on a computer.

SUMMARY OF THE INVASION

The invention provides a new and improved computer graphics system and method for generating pixel values for pixels in the image using a strictly deterministic methodology for generating sample points for use in evaluating integrals defining aspects of the image.

In brief summary, the computer graphics system in accordance with the invention generates pixel values for pixels in an image of objects in a scene, using strictly-deterministic low-discrepancy sequences, illustratively Halton sequences, as sample points for evaluating integrals which are used to simulate a number of computer graphic techniques, including

(1) soft shadows generated for scenes illuminated by a light source having a finite extent, such as a disk, as opposed to a point light source;

(2) Simulation of depth of field;

(3) motion blur;

(4) jittering; and

(5) global illumination.

The computer graphics system uses the low-discrepancy sequences:

(1) in connection with soft shadows, to generate sample points over the finite extent of the light source illuminating the scene;

(2) in connection with simulation of depth of field, to generate sample points over the area of the lens between the scene and the image;

(3) in connection with motion blur, to generate sample points over a time interval over which motion blur is to be simulated for moving objects in the scene;

(4) in connection with jittering, to generate jittered sample points over an image or a plurality of contiguous pixels; and

(5) in connection with global illumination, to generate sample points for use in a strictly-deterministic Russian roulette methodology for generating estimators for use in simulating global illumination.

Unlike the random numbers used in connection with the Monte Carlo technique, the low discrepancy sequences ensure that the sample points am evenly distributed over a respective region or time interval, thereby reducing error in the image which can result from clumping of such sample points which can occur in the Monte Carlo technique. In particular, the invention facilitates the generation of images of improved quality when using the same number of sample points at the same computational cost as in the Monte Carlo technique.

BRIEF DESCRIPTION OF TEE DRAWINGS

This invention is pointed out with particularity in the appended claims. The above and further advantages of this invention may be better understood by referring to the following description taken in conjunction with the accompanying drawings, in which:

FIG. 1 depicts a computer graphics system constructed in accordance with the invention; and

FIGS. 2 through 6 are flow-charts useful in understanding the operations of the computer graphics system depicted in FIG. 1, in accordance with the invention.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

The invention provides a computer graphic system and method for generating pixel values for pixels in an image of a scene, which makes use of a strictly-deterministic methodology for generating sample points for use in generating sample values for evaluating the integral or integrals whose function(s) represent the contributions of the light reelected from the various points in the scene to the respective pixel value, rather than the random or pseudorandom Monte Carlo methodology which has been used in the past. The strictly-deterministic methodology ensures a priori that the sample points will be generally evenly distributed over the interval or region over which the integral(s) is (are) to be evaluated in a low-discrepancy manner.

FIG. 1 attached hereto depicts an illustrative computer system 10 that makes use of such a strictly deterministic methodology. With reference to FIG.), the computer system 10 in one embodiment includes a processor module 11 and operator interface elements comprising operator input components such as a keyboard 12A and/or a mouse 12B (generally identified as operator input element(s) 12) and an operator output element such as a video display device 13. The illustrative computer system 10 is of the conventional stored-program computer architecture. The processor module 11 includes, for example, one or more processor, memory and mass storage devices, such as disk and/or tape storage elements (not separately shown), which perform processing and storage operations in connection with digital data provided thereto. The operator input element(s) 12 are provided to permit an operator to input information for processing. The video display device 13 is provided to display output information generated by the processor module II on a screen 14 to the operator, including data that the operator may input for processing, information that the operator may input to control processing, as well as information generated during processing. The processor module 11 generates information for display by the video display device 13 using a so-called “graphical user interface” (“GUI”), in which information for various applications programs is displayed using various “windows.” Although the computer system 10 is shown as comprising particular components, such as the keyboard 12A and mouse 12B for receiving input information from an operator, and a video display device 13 for displaying output information to the operator, it will be appreciated that the computer system 10 may include a variety of components in addition to or instead of those depicted in FIG. 1.

In addition, the processor module 11 include one or more network ports, generally identified by reference numeral 14, which are connected to communication links which connect the computer system 10 in a computer network. The network ports enable the computer system 10 to transmit information to, and receive information from, other computer systems and other devices in the network. In a typical network organized according to, for example, the client-server paradigm, certain computer systems in the network are designated as servers, which store data and programs (generally, “information”) for processing by the other, client computer systems, thereby to enable the client computer systems to conveniently share the information. A client computer system which needs access to information maintained by a particular server will enable the server to download the information to it over the network. After processing the data, the client computer system may also return the processed data to the sever for storage. In addition to computer systems (including the above-described servers and clients), a network may also include, for example, printers and facsimile devices, digital audio or video storage and distribution devices, and the like, which may be shared among the various computer systems connected in the network. The communication links interconnecting the computer systems in the network may, as is conventional, comprise any convenient information-carrying medium, including wires, optical fibers or other media for carrying signals among the computer systems. Computer Systems transfer information over the network by means of messages transferred over the communication links, with each message including information and an identifier identifying the device to receive the message.

As noted above, the computer graphics System 10 generates pixel values for pixels in an image of a scene, which makes use of a strictly-deterministic methodology for selecting sample points used to generate sample values which are then used in evaluating the integral or integrals whose function(s) represent the contributions of the light reflected from the various points in the scene to the respective pixel value. In one particular embodiment the strictly-deterministic methodology used by the computer graphics system 10 provides a low-discrepancy sample point sequence which ensures, priori, that the sample points are generally evenly distributed throughout the region over which the respective integrals are being evaluated. In one embodiment, the sample points that are used am based on a so-called Halton sequences. See, for example, J. H. Halton, Numerische Mathematik, Vol. 2, pp. 84-90 (1960) and W. H. Press, et al., Numerical Recipes in Fortan (2d Edition) page 300 (Cambridge University Press, 1992). In a Halton sequence generated for number base “p,” where base “p” is a selected prime number, the “k-th” value of the sequence, represented by H_(p) ^(k) is generated by

-   -   (1) writing the value “k” as a numerical representation of the         value in the selected base “p,” thereby to provide a         representation for the value as D_(M)D_(M-1) . . . D₂D₁, where         D_(m) (m=1, 2, . . . , M) are the digits of the representation,         and     -   (2) putting a radix point (corresponding to a decimal point for         numbers written in base ten) at the end of the representation         D_(M)D_(M-1), . . . , D₂D₁ written in step (1) above, mad         reflecting the digits around the radix point to provide 0.D₁D₂ .         . . D_(M-1)D_(M), which corresponds to H_(p) ^(k).         It will be appreciated that, regardless of the base “p” selected         for the representation, for any series of values, one, two, . .         . “k,” written in base “p,” the least significant digits of the         representation will change at a faster rate than the most         significant digits. As a result, in the Halton sequence H_(p) ¹,         H_(p) ², . . . H_(p) ^(k), the most significant digits will         change at the faster rate, so that the early values in the         sequence will be generally widely distributed over the interval         from zero to one, and later values in the sequence will fill in         interstices among the earlier values in the sequence. Unlike the         random or pseudorandom numbers used in the Monte Carlo method as         described above, the values of the Halton sequence are not         statistically independent; on the contrary, the values of the         Halton sequence are strictly deterministic, “maximally avoiding”         each other over the interval, and so they will not clump,         whereas the random or pseudo-random numbers used in the Monte         Carlo method may clump.

It will be appreciated that the Halton sequence as described above provides a sequence of values over the interval from zero to one, inclusive along a single dimension. A multidimensional Halton sequence can be generated in a similar manner, but using a different base for each dimension.

A generalized Halton sequence, of which the Halton sequence described above is a special case, is generated as follows. For each starting point along the numerical interval from zero to one, inclusive, a different Halton sequence is generated. Defining the pseudo-sum x⊕_(p)y for any x and y over the interval from zero to one, inclusive, for any integer “p” having a value greater than two, the pseudo-sum is formed by adding the digits representing “x” and “y” in reverse order, from the most-significant digit to the least-significant digit, and for each addition also adding in the carry generated from the sun of next more significant digits. Thus, if “x” in base “p” is represented by 0.X₁X₂ . . . X_(M-1)X_(M), where each “X_(m)” is a digit in base “p,” and if “y” in base “p” is represented by 0.Y₁Y₂ . . . Y_(N-1)Y_(N), where each “Y_(n)” is a digit in base “p” (and where “M,” the number of digits in the representation of “x” in base “p”, and “N,” the number of digits in the representation of “y” in base “p”, may differ), then the pseudo-sum “z” is represented by 0.Z₁Z₂ . . . Z_(L-1)Z_(L), where each “Z₁” is a digit in base “p” given by Z₁=(X₁+Y₁+C₁)mod p, where “mod” represents the modulo function,

${{and}\mspace{14mu} C_{l}} = \left\{ \begin{matrix} {{{1\mspace{14mu}{for}\mspace{14mu} X_{l - 1}} + Y_{l - 1} + C_{l - 1}} \geq p} \\ {0\mspace{14mu}{otherwise}} \end{matrix} \right.$ and C₁ is set to zero.

Using the pseudo-sum function as described above, the generalized Halton sequence is generated as follows. If “m” is an integer, and x₀ is an arbitrary value on the interval from zero to one, inclusive, then the “p”-adic von Neumann-Kakutani transformation T_(p)(x) is given by

$\begin{matrix} {{{T_{p}(x)}:={x \oplus_{p}\frac{1}{p}}},} & (4) \end{matrix}$ and the generalized Halton sequence x₀, x₁, x₂, . . . is defined recursively as x _(n+1) =T _(p)(x _(n))  (5) From equations (4) and (5), it is clear that, for any value for “p,” the generalized Halton sequence can provide a different sequence will be generated for each starting value of “x,” that is, for each x_(Q). It will be appreciated that the Halton sequence H_(p) ^(k) as described above is a special case of the generalized Halton sequence (equations (4) and (5)) for x₀=0.

The use of the low-discrepancy sequence in evaluating integrals to generate pixel values for pixels in an image in computer graphics will be illustrated in connection several specific, computer application in particular, the generation of pixel values for images representing

(1) soft shadows generated for scenes illuminated by a light source having a finite extent, such as a disk, as opposed to a point light source;

(2) Simulation of depth of field;

(3) motion blur,

(4) jittering; and

(5) global illumination.

Operations performed by the computer graphics system 10 in connection with each of these will be described below.

(1) Soft Shadows

Soft shadows can occur in a scene when objects in the scene are illuminated by a light source having a finite extent or an identifiable area, such as a disk, instead of a point light source. Illustratively, when a solar eclipse occurs, the penumbra portion of the shadow cast by the moon on the earth is a soft shadow, and the umbra portion constitutes a full shadow. The umbra portion of the eclipse occurs in regions of the earth for which the moon completely obscures the sun, and the penumbra portion occurs in regions for which the moon partially obscures the sun. The degree of shadow in the penumbra lessens as one proceeds outwardly from the umbra, and the penumbra constitutes the “soft shadow” for the eclipse. For a particular shadow in a scene, the soft shadow represents a grading from the region (if any) of the scene that is in full shadow to the region for which there is no shadow.

In a scene, a portion of a pixel value for a point in a scene representing illumination by a light source having an area is generated by averaging the illumination of a particular point in a scene by a light source over the area of the light source. If the point in the scene is in a full shadow region, which may occur if the point is completely obscured by one or more objects in the scene, then the average will represent a luminance level representative of full shadow. Similarly, if the point is in a no-shadow region, then the average will represent a luminance level representative of no shadow. On the other hand, if the point is partially obscured from the full area of the light source by objects in the scene, and thus is in a soft shadow region, then the average will represent an intermediate luminance level based on the amount of the light source that is obscured. In any case, the average is given illustratively by the two-dimensional integral

$\begin{matrix} {{{I\left( \overset{\rightarrow}{x} \right)} = {\int_{A^{t}}{\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{t}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{t}}}^{2}}{L_{e}\left( {\overset{\rightarrow}{x}}^{t} \right)}{\mathbb{d}A^{t}}}}},} & (6) \end{matrix}$ where ({right arrow over (x)}) is a point in the scene for which the illumination value is being generated, ({right arrow over (x)}′) is a point on the area light source, I({right arrow over (x)}) represents the illumination at the point ({right arrow over (x)}) in the scene, L₄({right arrow over (x)}) denotes the level of light emission of the area light source, and V({right arrow over (x)},{right arrow over (x)}′) is a visibility function that equals one if the point ({right arrow over (x)}′) on the light source is visible from the point ({right arrow over (x)}) in the scene and zero if the if the point ({right arrow over (x)}′) on the light source is not visible from the point ({right arrow over (x)}) in the scene. The integral is evaluated over the area A′ of the light source. The formulation of the function

$\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{t}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{t}}}^{2}}{L_{e}\left( {\overset{\rightarrow}{x}}^{l} \right)}$ for a particular image is known to one of skill in the art.

In accordance with the invention, the computer graphics system 10 evaluates the integral (equation (6)) to generate a pixel value by selecting a number “N” of sample points ({right arrow over (x)}_(i)′) using a two-dimensional generalized Halton sequence. After the sample points ({right arrow over (x)}_(i)′) are generated, the computer a graphics system 10 evaluates the function

$\begin{matrix} {\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{t}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{t}}}^{2}}{{L_{\theta}\left( {\overset{\rightarrow}{x}}_{i}^{l} \right)}.}} & (7) \end{matrix}$ for each of the generated sample points and approximates the value of the integral (equation (6)) as

$\begin{matrix} {{I\left( \overset{\rightarrow}{x} \right)} = {\overset{\_}{I\left( \overset{\rightarrow}{x} \right)} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}_{i}^{l}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}_{i}^{l}}}^{2}}{L_{\theta}\left( {\overset{\rightarrow}{x}}_{i}^{l} \right)}}}}}} & (8) \end{matrix}$ for each of the points ({right arrow over (x)}) in the scene for which the illumination value I({right arrow over (x)}) is to be generated. The use of a low-discrepancy sequence, illustratively the Halton sequence, will ensure that the sample points will not clump, but instead will be evenly distributed over the am of the light source.

In one embodiment, for each of the points ({right arrow over (x)}) in the scene for which the illumination value I({right arrow over (x)}) is to be generated, the computer graphics system 10 uses a different Halton sequence, generated in accordance with the generalized Halton sequence methodology described above (equation (5)), so as to avoid generating pixel values for which the soft shadows might otherwise appear blocky. In that embodiment, the particular Halton sequence is generated using a base value x₀ which is based on the coordinates of the point in the image for which the pixel value is being generated that is associated with the point ({right arrow over (x)}) in the scene.

Operations described above in connection with the generation of pixel values so as to provide soft shadows are depicted on the flow chart in FIG. 2. Since the operations as depicted in that flow-chart will be readily apparent to those skilled in the art from the above description, the flow-chart in that FIG. will not be separately described in this specification.

It will be appreciated that the function

$\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{t}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{t}}}^{2}}{L_{e}\left( {\overset{\rightarrow}{x}}^{i} \right)}$ used in equation (6) is illustrative of the functions that can be used in connection with generation of pixel values to simulate soft shadows, and other functions will be apparent to those skilled in the art, with corresponding changes in equations (7) and (8). For example, although in the denominator of

$\frac{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{i}} \right)}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{i}}}^{2}}$ in equation (6), the term “|{right arrow over (x)}−{right arrow over (x)}′|” is indicated as being taken to the second power (that is, squared), it will be appreciated that other powers can be used, in which case equations (7) and (8) would be modified accordingly. In addition, although the Halton sequence has been indicated as being used to provide the sample points for the evaluation, it will be appreciated that other low-discrepancy sequences, which are known in the art, could be used instead.

In addition, it will be appreciated that, although the computer graphics system 10 has been described as simulating soft shadows in connection with area light sources, the computer graphics system 10 can also simulate soft shadows in connection with a linear light source in a manner similar to that described above. As with simulation of soft shadows for an area light source, the computer graphics system 10 will constrain the sample points ({right arrow over (x)}′_(t)) to fall on the light source. In addition, if the light source is a linear lift source, the computer graphics system 10 can generate the sample points ({right arrow over (x)}_(t)′) using a one-dimensional generalized Halton sequence.

(2) Depth of Field Simulation

As noted above, the computer graphics system 10 ran generate pixel values defining a rendered image representing an image which would be recorded for a pinhole camera, or alternatively it can generate pixel values defining a rendered image representing an image which would be recorded for a camera with a lens. Typically, for a camera without a lens, all of the objects are normally in focus. However, for a conventional camera with a lens, the objects at a particular distance from the lens, as well as objects within a plane of predetermined distance thereof, known as the “depth of field” would be in focus. For objects which are closer or more distant, the objects would be increasingly blurred.

To simulate generation of an image for a camera with a depth of field, the computer graphics system 10 generates a pixel value for each pixel based on the evaluation of the integral

$\begin{matrix} {{{L\left( {x,y} \right)} = {\int_{A_{eff}}{{\overset{\_}{L}\left( {x,y,x^{i},y^{i}} \right)}{\mathbb{d}x^{i}}{\mathbb{d}y^{i}}}}},} & (9) \end{matrix}$ where L(x,y,x′,y′) denotes the luminance coming from the point (x′,y′) on the lens in the direction of the point (x,y) in the image plane. The computer graphics system 10 evaluates the integral over the area A_(eff) of the lens. The formulation of the function L(x,y,x′,y′) for a particular image is known to one of skill in the art.

In accordance with the invention, the computer graphics system 10 evaluates the integral (equation (9)) to generate a pixel value by selecting a number “N” of sample points for points (x₁,y₁) on the leas using the Halton sequence to provide the sample points. After the sample points are generated, the computer graphics system 10 evaluates the function L(x,y,x′,y′) for each of the “N” sample points (x₁,y₁) and approximates the integral (equation (9)) as

$\begin{matrix} {{{L\left( {x,y} \right)} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{\overset{\_}{L}\left( {x,y,x_{i},y_{i}} \right)}}}},} & (10) \end{matrix}$ In one particular embodiment, for each point (x_(i),y_(i)) on the image plane, the computer graphics system 10 uses a different Halton sequence, generated in accordance with the generalized Halton sequence methodology described above (equation (5)), so as to avoid generating pixel values for which the rendered image might otherwise appear blocky. In that embodiment the particular Halton sequence is generated using a base value x₀ which is based on the coordinates of the point in the image for which the pixel value is being generated that is associated with the point (x₁, y₁) in the image plane. The use of a low-discrepancy sequence, illustratively the Halton sequence, will ensure that the sample points will not clump, but instead wilt be evenly distributed over the area of the lens.

Operations described above in connection with the generation of pixel values so as to provide depth of field are depicted on the flow-chart in FIG. 3. Since the operations as depicted in that flow-chart will be readily apparent to those skilled in the art from the above description, the flow-chart in that FIG. will not be separately described in this specification.

The use of sample points (x₁) selected as described above for the evaluation of the integral (equation (9)) is advantageous in that the use of the low-discrepancy set of sample points has a “self-avoiding” property that ensures that the sample points will not be clumped together, which clumping is possible with prior methodologies such as the random-number-based Monte Carlo method. A further advantage is that the number of sample points (x_(i)) does not need to be selected a priori prior to the computation.

It will be appreciated that the function L(x,y,x′,y′) used in equation (9) is illustrative of the functions that can be used in connection with generation of pixel values to simulate depth of field, and other functions will be apparent to those skilled in the art, with corresponding changes in equation (10). In addition, although the Halton sequence has been indicated as being used to provide the sample points for the evaluation, it will be appreciated that other low-discrepancy sequences, which are known in the art, could be used instead.

(3) Motion Blur

Motion blur occurs when, for example, an object in a scene being recorded by a stationary camera is moving. The motion blur occurs because the camera's shutter has a non-zero time interval over which it is open, and, if the camera is not moved to so as to maintain the moving object at precisely the same point in the image, the point at which the moving object appears in the image moves over the time interval. Accordingly, edges of the object which are transverse to the direction of motion appear to be blurred over the image.

To simulate generation of an image of a scene in which an object is moving, by a camera whose shutter has a non-zero time interval over which it is open, the computer graphics system 10 generates a pixel value for each pixel based on the evaluation of the integral

$\begin{matrix} {{L\left( {x,y} \right)} = {\frac{1}{t_{s}}{\int_{0}^{t_{s}}{{L\left( {x,y,t} \right)}{\mathbb{d}t}}}}} & (11) \end{matrix}$ where L(x,y) is the luminance of point (x,y), L(x,y,t) is the luminance of point (x,y) in the image at time “t,” and “t_(S)” is the time period over which the shutter is open. It will be appreciated that L(x,y) is essentially the average of L(x,y,t) over time t_(S). The formulation of the function L(x,y,t) for a particular image is known to one of skill in the art.

In accordance with the invention, the computer graphics system 10 evaluates the integral (equation (11)) to generate a pixel value by selecting a number “N” of sample points for points (t_(i)) over the time interval from zero to r_(S) using the Halton sequence to provide the sample points. After the sample points are generated, the computer graphics system 10 evaluates the function L(x,y,t) for each of the “N” sample points (t₁) and approximates the integral (equation (11)) as

$\begin{matrix} {{L\left( {x,y} \right)} = {\overset{\_}{L\left( {x,y_{t}} \right)} = {\frac{1}{N}{\sum\limits_{i = l}^{N}{L\left( {x,y,t_{l}} \right)}}}}} & (12) \end{matrix}$ In one particular embodiment, for each pixel in the image, the computer graphics system 10 uses a different generalized Halton sequence, generated in accordance with the generalized Halton sequence methodology described above (equation (5)), so as to avoid generating pixel values for which the rendered image might otherwise appear blocky. In that embodiment, the particular Halton sequence is generated using a base value x, which is based on the coordinates of the point (x,y) in the image for which the pixel value is being generated. The use of a low-discrepancy sequence, illustratively the Halton sequence, will ensure that the sample points will not clump, but instead will be evenly distributed over the time period over which the integral (equation (11) is to be evaluated).

Operations described above in connection with the generation of pixel values so as to provide motion blur are depicted on the flow-chart in FIG. 4. Since the operations as depicted in that flow-chart will be Wily apparent to those skilled in the art from the above description, the flow-chart in that FIG. will not be separately described in this specification.

It will be appreciated that the function L(x,y,t) used in equation (11) is illustrative of the functions that can be used in connection with generation of pixel values to simulate depth of fields and other functions will be apparent to those skilled in the art, with corresponding changes in equation (12). In addition, although the Halton sequence has been indicated as being used to provide the sample points for the evaluation, it will be appreciated that other low-discrepancy sequences, which are known in the art, could be used instead.

In addition, it will be appreciated that the computer graphics system 10 may use a one-dimensional Halton sequence to generate sample points (t_(i)) for use in equation (12) along a temporal dimension “t” for each sample point (x,y) in the image. In that case, during generation of the pixel value, the computer graphics system 10 will generate the luminance value L(x,y) for the sample point (x,y) in accordance with equation (12). Alternatively, the computer graphics system 10 may use, for example, a three-dimensional Halton sequence to generate sample points (x_(i),y_(i),t_(i)) along both the temporal dimension “t” and spatial dimensions “x” and “y” of the image plane, for use in equation (12), and can generate the luminance value for the pixel using equation (12) using the luminance values L(x_(i),y_(i),t_(i)), where (x_(i),y_(i)) are sample points within the region of the pixel.

(4) Jittering

To generate a pixel value for a pixel which represents the color of the pixel at the respective point in the image, the color represented by the pixel value is averaged over the area of the pixel. To simulate that the computer graphics system 10 generates the pixel value for pixel P, to have an averaged color L, by evaluating the integral

$\begin{matrix} {{L_{i} = {\frac{1}{P_{t}}{\int_{P_{t}}{{L\left( {x,y} \right)}{\mathbb{d}x}{\mathbb{d}y}}}}},} & (13) \end{matrix}$ where L(x,y) represents the color at point (x,y) in the image, and |P_(i)| represents the area of the pixel P_(i). The formulation of the function L(x,y) for a particular image is known to one of skill in the art.

The computer graphics system 10 can evaluate the integral (equation (13)) to generate a pixel value by selecting a number “N” of sample points (x₁,y₁) in the pixel P_(i) using the Halton sequence to provide the sample points. After the sample points are generated, the computer graphics system 10 evaluates the function L(x,y) for each of the “N” sample points (x_(i),y_(i)) and approximates the integral (equation (13)) as

$\begin{matrix} {{L\left( {x,y} \right)} = {\overset{\_}{L\left( {x,y} \right)} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{L\left( {x_{i},y_{i}} \right)}}}}} & (14) \end{matrix}$ Several problems arise, however, if the integral (equation (13)) is evaluated using a Halton sequence generated for each pixel. First, although the Halton sequence guarantees that no clumping occurs within a single pixel, it will not guarantee that clumping will not occur at boundaries of adjacent pixels. In addition, the Halton sequences generated for the pixels would exhibit periodicity on the pixel level, in which case artifacts may be generated in the image which can be evident to the eye.

Thus, to accommodate these problems, in accordance with the invention, the computer graphics system 10 generates the Halton sequence to generate the sample points either for the image as a whole or for a predetermined number of contiguous pixels in the following manner. Initially, the computer graphics system 10 divides the image or the predetermined number of contiguous pixels based on a grid of size “n” by “m,” where n=2^(i) is a positive power (“i”) of two and m=3¹ is a positive power (“j”) of three. (In this description, two and three are the number bases (that is, “p” in equations 4 and 5 describing the one-dimensional Halton sequence) selected for generation of the two-dimensional Halton sequence; if the computer graphics system 10 uses other number bases for generation of the two-dimensional Halton sequence, then “n” and “m” would be selected to be powers of those number bases.) Then the computer graphics system 110 generates the set of sample points (x₁,y₁) to be used in evaluating equation (14) as (nH₂ ^(k), mH₃ ^(k)) for k=1, . . . , nm, which constitutes a scaled two-dimensional Halton sequence, with the scaling being in accordance with the values of “n” and “m”. The sample points so generated, precisely one sample point will be provided in each of a plurality of sub-pixels in each pixel, if the left and lower boundaries of each sub-pixel are deemed to form part of the sub-pixel and the right and upper boundaries of each sub-pixel are deemed not to form part of the sub-pixel.

For example, if the computer graphics system 10 is to generate sample points on “N” by “N” sub-pixels for each pixel, and if the number of columns in the image or the selected sub-set of contiguous pixels is Res_(x), and if the number of rows of pixels in the image or the selected sub-set of contiguous pixels is Res_(y), then the computer graphics system 10 can generate a number of N·Res_(s)x N·Res_(y), of sample points to be used with the pixels in the image or selected subset of pixels by initially selecting integers “i” and “j” such that n=2¹≧N·Res_(x) and m=3¹≧N·Res_(y). Note that the sub-pixel grid of “n” by “m” sub-pixels will in general be larger than the size of the image or selected subset of contiguous pixels.

According to the mechanism described above, the computer graphics system 10 can evaluate the integral in equation (14) for each pixel using the sample points which are provided within the area of the respective pixel.

Several benefits arise form generating sample points using the scaled two-dimensional Halton sequence (nH₂ ^(k), mH₃ ^(k)) for the entire image or selected sub-set of contiguous pixels in evaluating the integral in equation (14), instead of using the unscaled Halton sequence (that is, illustratively, (H₂ ^(k), H₃ ^(k))) within one pixel as the sample points. First, by using a scaled two dimensional Halton sequence, periodicity of the sample points on the level of a pixel, which can occur in connection with the unscaled two-dimensional Halton sequence, will be avoided. In addition, the use of a scaled two-dimensional Halton sequence (nH₂ ^(k), mH₃ ^(k)) will ensure that no clumping of sample points will occur at the boundaries of adjacent pixels, which can occur in connection with the unsealed two-dimensional Halton sequence. Therefore, the use of a scaled two-dimensional Halton sequence (nH₂ ^(k), mH₃ ^(k)) will ensure that the sample points will be evenly distributed throughout the entire image or contiguous region of pixels. This will also be the case if relatively few sample points a used, and even if only one sample point per pixel is used.

Operations described above in connection with the generation of pixel values so as to provide jittering are depicted on the flow-chart in FIG. 5. Since the operations as depicted in that flowchart will be readily apparent to those skilled in the art from the above description, the flow-chart in that FIG. will not be separately described in this specification.

It will be appreciated that the function L(x,y) used in equation (13) is illustrative of the functions that can be used in connection with generation of pixel values to simulate jittering, and other functions will be apparent to those skilled in the art, with corresponding changes in equation (14). In addition, although the Halton sequence has been indicated as being used to provide the sample points for the evaluation, it will be appreciated that other low-discrepancy sequences, which are known in the art, could be used instead.

(5) Global Illumination

“Global illumination” includes a class of optical effects, such as indirect illumination, diffuse and glossy inter-reflections, caustics and color bleeding, which the computer graphics system 10 simulates in generating an image of objects in a scene. For the simulation of global illumination, a “rendering equation” is solved. For the general form of an illustrative rendering equation useful in global illumination simulation, namely:

$\begin{matrix} {{L\left( {\overset{\rightarrow}{x},\overset{\rightarrow}{w}} \right)} = {{L_{e}\left( {\overset{\rightarrow}{x},\overset{\rightarrow}{w}} \right)} + {\int_{S^{t}}{{f\left( {\overset{\rightarrow}{x},\left. {\overset{\rightarrow}{w}}^{t}\rightarrow\overset{\rightarrow}{w} \right.} \right)}{G\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{l}} \right)}{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{l}} \right)}{L\left( {{\overset{\rightarrow}{x}}^{i},{\overset{\rightarrow}{w}}^{i}} \right)}{\mathbb{d}A^{i}}}}}} & (15) \end{matrix}$ it is recognized that the light radiated at a particular point {right arrow over (x)} in a scene is generally the sum of two components, namely, the amount of light (if any) that is emitted mom the point and the amount of light (if any) which originates from all other points and which is reflected or otherwise scattered from the point {right arrow over (x)}. In equation (15), L({right arrow over (x)},{right arrow over (w)}) represents the radiance at the point {right arrow over (x)} in the direction {right arrow over (w)}=(θ,φ) (where “θ” represents the angle of direction {right arrow over (w)} relative to a direction orthogonal of the surface of the object in the scene containing the point {right arrow over (x)}, and “φ” represents the angle of the component of direction {right arrow over (w)} in a plane tangential to the point {right arrow over (x)}). Similarly, L({right arrow over (x)}′,{right arrow over (w)}′) in the integral represents the radiance at the point {right arrow over (x)}′ in the direction {right arrow over (w)}′=(θ′,φ′) (where “θ′” represents the angle of direction {right arrow over (w)}′ relative to a direction orthogonal of the surface of the object in the scene containing the point {right arrow over (x)}′, and “φ′” represents the angle of the component of direction {right arrow over (w)}′ in a plane tangential to the point {right arrow over (x)}′), and represents the light, if any, that is emitted from point {right arrow over (x)}′ which may be reflected or otherwise scattered from point {right arrow over (x)}.

In equation (15), L_(e)({right arrow over (x)},{right arrow over (w)}) represents the first component of the sum, namely, the radiance due to emission form the point {right arrow over (x)} in the direction {right arrow over (w)}, and the integral over the sphere S′ represents the second component, namely, the radiance due to scattering of light at point {right arrow over (x)}. f({right arrow over (x)},{right arrow over (w)}′→{right arrow over (w)}) is a bidirectional scattering distribution function which describes how much of the light coming from direction {right arrow over (w)}′ reflected, refracted or otherwise see in the direction {right arrow over (w)}, and is generally the sum of a diffuse component, a glossy component and a specular component. In equation (15), the function G({right arrow over (x)},{right arrow over (x)}′) is geometric term

$\begin{matrix} {{{G\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{t}} \right)} = \frac{\cos\;{\theta cos\theta}^{\prime}}{{{\overset{\rightarrow}{x} - {\overset{\rightarrow}{x}}^{t}}}^{2}}},} & (16) \end{matrix}$ where θ and θ′ are angles relative to the normals of the respective surface at points {right arrow over (x)} and {right arrow over (x)}′, respectively. Further in equation (15), V({right arrow over (x)},{right arrow over (x)}′) is a visibility function which equals the value one if the point {right arrow over (x)}′ is visible from the point {right arrow over (x)} and zero if the point {right arrow over (x)}′ is not visible form the point {right arrow over (x)}. The formulation of the various functions L({right arrow over (x)},{right arrow over (w)}), L({right arrow over (x)}′,{right arrow over (w)}′), L_(g)({right arrow over (x)},{right arrow over (w)}), f({right arrow over (x)},{right arrow over (w)}→{right arrow over (w)}), G({right arrow over (x)},{right arrow over (x)}′) and V({right arrow over (x)},{right arrow over (x)}′) for a particular image is known to one of skill in the art.

The computer graphics system 10 uses global illumination and the rendering equation, namely, equation (15), in connection with generation of an image to simulate a number of optical effects as noted above. In particular, in connection with one aspect of simulation using ray tracing, in which the computer graphics system 10 simulates an image as viewed by an observer by tracing rays, representing photons, from a light source to the eye of the observer, in accordance with the invention the computer graphics system 10 uses a “strictly deterministic Russian roulette” methodology to determine whether or not to terminate a simulated ray, using a strictly-deterministic method in that determination.

By way of background, an equation such as the equation (15) of the form

$\begin{matrix} {{f(x)} = {{g(x)} + {\int_{0}^{1}{{K\left( {x,y} \right)}{f(y)}{\mathbb{d}y}}}}} & (17) \end{matrix}$ where f(x) (and similarly f(y)) is an unknown function, g(x) is a known function (in the context of the rendering equation (equation (15)) g(x)=L_(e)({right arrow over (x)},{right arrow over (w)})) and K(x,y) is another known function which serves as a “kernel” of the integral operator (in the context of the rendering equation (equation 15), K(x,w)=f({right arrow over (x)},{right arrow over (w)}′→{right arrow over (w)})G({right arrow over (x)},{right arrow over (x)}′)V({right arrow over (x)},{right arrow over (x)}′)) can be formally solved by repeatedly substituting the function “f” in the integral, as follows:

$\begin{matrix} {{f(x)} = {{g(x)} + {\int_{0}^{1}{{K\left( {x,x_{1}} \right)}{g\left( x_{1} \right)}{\mathbb{d}x}}} + {\int_{0}^{1}{\int_{0}^{1}{{K\left( {x,x_{1}} \right)}{K\left( {x_{1},x_{2}} \right)}{g\left( x_{2} \right)}{\mathbb{d}x_{1}}{\mathbb{d}x_{2}}}}} + {\int_{0}^{1}{\int_{0}^{1}{\int_{0}^{1}{{K\left( {x,x_{1}} \right)}{K\left( {x_{1},x_{2}} \right)}{K\left( {x_{2},x_{3}} \right)}{g\left( x_{3} \right)}{\mathbb{d}x_{1}}{\mathbb{d}x_{2}}{\mathbb{d}x_{3}}}}}} + {\ldots.}}} & (18) \end{matrix}$ which constitutes an infinite Neumann series. Equation (17), in turn, can be approximately numerically evaluated by performing a low-discrepancy sampling of the first “L” terms of the Neumann series in equation (18), where “g(x)” is considered as a zeroth term, using an “L”-dimensional low-discrepancy sequence (ξ₁ ^((n)), . . . , ξ_(L) ^((n))), where “n” denotes a sequence index. In one embodiment, an “L”-dimensional low-discrepancy sequence is illustratively an L-dimensional Halton sequence, for which, as described above, the elements of the sequence tend to maximally avoid one another. For each element of the sequence, an estimator value f^((n))(x) is generated as

$\begin{matrix} {{f^{(n)}(x)} = {{g(x)} + {{K\left( {x,\xi_{1}^{(n)}} \right)}{g\left( \xi_{1}^{(n)} \right)}} + {{K\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)}{g\left( \xi_{2}^{(n)} \right)}} + \ldots + {{K\left( {\xi_{L - 1}^{(n)},\xi_{L}^{(n)}} \right)}{g\left( \xi_{L}^{(n)} \right)}}}} & (19) \end{matrix}$ and the approximation for f(x) is obtained using “N” estimators f^((n))(x) generated in accordance with equation (19) as

$\begin{matrix} {{f(x)} = {\overset{\_}{f(x)} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}{{f^{(n)}(x)}.}}}}} & (20) \end{matrix}$ The use of a low-discrepancy sequence, illustratively the Halton sequence, will ensure that the sample points will not clump, but instead will be evenly distributed over the L-dimensional space over which the first “L” terms of the Neumann series (equation (18)) are to be evaluated.

One problem with using the methodology described above in connection with equations (17) through (20) to evaluate the rendering equation (equation (15)) is that, although the Neumann series (equation (18)) is an infinite series, to evaluate the series at some point the series will need to be truncated. In connection with evaluation of the rendering equation (equation (15)), truncation of the Neumann series may result in loss of desirable features in the image. To alleviate this problem, in accordance with the invention, the computer graphics system 10 uses a methodology which also generates an approximation for f(x) using “N” estimators, but which ensures that, for each estimator, the number of terms in the series used to generate the estimator is not infinite. Thus, in the methodology in accordance with the invention, no truncation is necessary for generation of the estimators, thereby ensuing that features of the image will not be lost.

The methodology in accordance with the invention, which is termed herein the “strictly deterministic Russian roulette” methodology, will be described below. Preliminarily, recognizing that the numerical value “one” an be represented as an integral as

$\begin{matrix} {1 = {\frac{1}{w}{\int_{0}^{1}{{\Theta\left( {w - x} \right)}{\mathbb{d}x}}}}} & (21) \end{matrix}$ where θ(x) denotes the Heaviside function (otherwise known as the “step function”) which is defined as

$\begin{matrix} {{\Theta(x)} = \left\{ {\begin{matrix} {{1\mspace{14mu}{for}\mspace{14mu} x} \geq 0} \\ {{0\mspace{14mu}{for}\mspace{14mu} x} < 0} \end{matrix},} \right.} & (22) \end{matrix}$ and where “w” is a weight factor from the interval zero (exclusive) to one (inclusive). Using equations (21) and (22), a strictly deterministic estimator 1 _(est) for the numerical value “one” as

$\begin{matrix} {1_{est}^{(n)} = {{\frac{1}{w}{\Theta\left( {w - \xi^{(n)}} \right)}} = \left\{ \begin{matrix} {{\frac{1}{w}\mspace{14mu}{for}\mspace{14mu} w} \geq \xi^{(n)}} \\ {{0\mspace{14mu}{for}\mspace{14mu} w} < \xi^{(n)}} \end{matrix} \right.}} & (23) \end{matrix}$ and generating an estimate for the numerical value “one” as

$\begin{matrix} {1 = {\overset{\_}{1} = {{\frac{1}{N}{\sum\limits_{n = 1}^{N}1_{est}^{(n)}}} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\frac{1}{w}{{\Theta\left( {w - \xi^{(n)}} \right)}.}}}}}}} & (24) \end{matrix}$

Using equation (21), assuming that K(x,y) takes values in the interval from zero to one, it (that is, K(x,y)) can be written as

$\begin{matrix} {{K\left( {x,y} \right)} = {\int_{0}^{1}{{\Theta\left( {{K\left( {x,y} \right)} - x^{\prime}} \right)}{{\mathbb{d}x^{\prime}}.}}}} & (25) \end{matrix}$ Using equation (25), the Neumann Genes (equation (18)) is re-formulated as

$\begin{matrix} {{f(x)} = {{g(x)} + {\int_{0}^{1}{\int_{0}^{1}{{\Theta\left( {{K\left( {x,x_{1}} \right)} - x_{1}^{\prime}} \right)}{g\left( x_{1} \right)}{\mathbb{d}x_{1}}{\mathbb{d}x_{1}^{\prime}}}}} + {\int_{0}^{1}{\int_{0}^{1}{\int_{0}^{1}{\int_{0}^{1}{{\Theta\left( {{K\left( {x,x_{1}} \right)} - x_{1}^{\prime}} \right)}{\Theta\left( {{K\left( {x_{1},x_{2}} \right)} - x_{2}^{\prime}} \right)}{g\left( x_{2} \right)}{\mathbb{d}x_{1}}{\mathbb{d}x_{1}^{\prime}}{\mathbb{d}x_{2}}{\mathbb{d}x_{\underset{1}{2}}^{\prime}}}}}}} + {\ldots.}}} & (26) \end{matrix}$ Comparing equation (26) with equation (18), it will be appreciated that, for every n-dimensional integral in equation (18), a 2n-dimensional integral has been provided in equation (26), and that, for every integration over x₁ (index 1=1, 2, . . . ), an additional integration over x₁′ is provided in equation 26.

As with equation (17) above, equation (26) is evaluated to provide a numerical approximation by performing a low-discrepancy sampling of the first “L” terms of the Neumann series in equation (26), where “g(x)” is considered as a zeroth term, using a multidimensional low-discrepancy sequence (ξ₁ ^((n)), ξ′₁ ^((n)), ξ₂ ^((n)), ξ′₂ ^((n)), . . . , ξ_(L) ^((n)), ξ′_(L) ^((n))) where “n” denotes a sequence index and “2L” is the largest number of components that are required in the course of the simulation of length “N.” It will be apparent from the following that the value of “L” does not have to be known or selected by the computer graphics system 10 a priori, and that the successive components ξ₁ ^((n)) and ξ′₁ ^((n)) of the low-discrepancy sequence can be generated on demand. In one-embodiment, each “2L-dimensional” low-discrepancy sequence is illustratively an 2L-dimensional Halton sequence, for which, as described above, the elements of the sequence tend to maximally avoid one another. For each element of the sequence, an estimator value f_(RR) ^((n))(x) is generated as

$\begin{matrix} {{f_{RR}^{(n)}(x)} = {{g(x)} + {{\Theta\left( {{K\left( {x,\xi_{1}^{(n)}} \right)} - \xi_{1}^{\prime{(n)}}} \right)}{g\left( \xi_{1}^{(n)} \right)}} + {{\Theta\left( {{K\left( {x,\xi_{1}^{(n)}} \right)} - \xi_{1}^{\prime{(n)}}} \right)}{\Theta\left( {{K\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)} - \xi_{2}^{\prime{(n)}}} \right)}{g\left( \xi_{2}^{(n)} \right)}} + {{\Theta\left( {{K\left( {x,\xi_{1}^{(n)}} \right)} - \xi_{1}^{\prime{(n)}}} \right)}{\Theta\left( {{K\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)} - \xi_{2}^{\prime{(n)}}} \right)}{\Theta\left( {{K\left( {\xi_{2}^{(n)},\xi_{3}^{(n)}} \right)} - \xi_{3}^{\prime{(n)}}} \right)}{g\left( \xi_{3}^{(n)} \right)}} + {\ldots.}}} & (27) \end{matrix}$ It will be appreciated that, in equation (27), in the context of the rendering equation (equation (15)), the term “g(x)” in the sum corresponds to the emitted radiance term L_(e)({right arrow over (x)},{right arrow over (w)}) of the rendering equation, and the other terms provide an estimate for the integral

$\int_{s^{\prime}}{{f\left( {\overset{\rightarrow}{x},\left. {\overset{\rightarrow}{w}}^{\prime}\rightarrow\overset{\rightarrow}{w} \right.} \right)}{G\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{\prime}} \right)}{V\left( {\overset{\rightarrow}{x},{\overset{\rightarrow}{x}}^{\prime}} \right)}{L\left( {{\overset{\rightarrow}{x}}^{\prime},{\overset{\rightarrow}{w}}^{\prime}} \right)}{\mathbb{d}A^{\prime}}}$ in the rendering equation for the particular element of the multi-dimensional Halton sequence used in the generation of the estimator.

It will be appreciated that from the definition of the Heaviside function (equation (22) that, if, at a particular level “1,” the value of ξ′₁ ^((n)) is larger than K(ξ₁₋₁ ^((n)),ξ₁ ^((n))), the corresponding Heaviside function will be zero at that term, and for successively higher terms in equation (27). Accordingly, by formulating the estimator f_(RR) ^((n))(x) as in equation 27, the infinite Neumann series is self-truncating and therefore reduced to a finite series. Thus, the approximation for f(x) can be obtained as

$\begin{matrix} {{{f(x)} = {\overset{\_}{f(x)} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}{f_{RR}^{(n)}(x)}}}}},} & (28) \end{matrix}$ which, in the context of the rendering equation (equation (15)) provides the value for L({right arrow over (x)},{right arrow over (w)}), that is, the radiance at the point {right arrow over (x)} in the image in the direction {right arrow over (w)}=(θ,φ).

As described above, the methodology described above in connection with equations (21) through (28) assumes that K(x,y) takes values in the numerical interval from zero to one. If K(x,y) does not take values on that interval, then the methodology can be generalized by taking a function p(x,y) that does take values in the interval from zero to one, and writing K(x,y) as

$\frac{K\left( {x,y} \right)}{p\left( {x,y} \right)}{p\left( {x,y} \right)}$ and replace the expression (reference equation (25)) by

$\frac{K\left( {x,y} \right)}{\overset{\_}{p}\left( {x,y} \right)}{\int_{0}^{1}{{\Theta\left( {{p\left( {x,y} \right)} - y^{\prime}} \right)}{{\mathbb{d}y^{\prime}}.}}}$ In that case, the estimator value f_(RR) ^((n))(x) (equation (27)) would be generated as:

$\begin{matrix} {{f_{RR}^{(n)}(x)} = {{g(x)} + {\frac{K\left( {x,\xi_{1}^{(n)}} \right)}{p\left( {x,\xi_{1}^{(n)}} \right)}{\Theta\left( {{p\left( {x,\xi_{1}^{(n)}} \right)} - \xi_{1}^{\prime{(n)}}} \right)}{g\left( \xi_{1}^{(n)} \right)}} + {\frac{K\left( {x,\xi_{1}^{(n)}} \right)}{p\left( {x,\xi_{1}^{(n)}} \right)}{\Theta\left( {{p\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)} - \xi_{2}^{\prime{(n)}}} \right)}\frac{K\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)}{p\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)}{\Theta\left( {{p\left( {\xi_{1}^{(n)},\xi_{2}^{(n)}} \right)} - \xi_{2}^{\prime{(n)}}} \right)}{g\left( \xi_{2}^{(n)} \right)}} + {\ldots.}}} & \left( {27a} \right) \end{matrix}$

With this background, in accordance with the strictly deterministic Russian roulette methodology, after the integral kernel K(x,x′)=f({right arrow over (x)},{right arrow over (w)}′-{right arrow over (w)})G({right arrow over (x)},{right arrow over (x)}′)V({right arrow over (x)},{right arrow over (x)}′) and the emitted radiance term L_(e)({right arrow over (x)},{right arrow over (w)}) have been developed for the rendering equation (equation (15)) for a point {right arrow over (x)} in the scene for which an image is being simulated by the computer graphics system 10, the computer graphics system 10 generates a numerical approximation of the solution of the rendering equation. In that operation, a value for “N,” the number of estimators f^((n)) _(RR)(x) to be used in generating the approximation for L({right arrow over (x)},{right arrow over (w)}) in the rendering equation (equation (28)) is selected, and the computer graphics system 10 generates “N” elements of a multi-dimensional Halton sequence. For each such element, the computer graphics system 10 will generate the estimator f^((n)) _(RR)(x) in accordance with equation (27). In that option, the computer graphics system 10 generates values for each successive term of the sum in equation (27), and adds the generated value to the previously-generated value(s), until it determines that the term has the value zero. When the computer graphics system 10 determines that a term of the sum in equation (27) is zero, it can terminate operations for that particular estimator f^((n)) _(RR)(x). After the computer graphics system 10 has generated estimators f^((n)) _(RR)(x) for all of the “N” elements of the multi-dimensional Halton sequence that were generated as described above, the computer graphics system 10 will generate a numerical approximation for the rendering equation as the average of the estimators, as indicated in connection with equation (28).

Operations described above in connection with the generation of pixel values so as to simulate global illumination are depicted on the flow-chart in FIG. 6. Since the operations as depicted in that flow-chart will be readily apparent to those skilled in the art from the above description, the flowchart in that FIG. will not be separately described in this specification.

It will be appreciated by those skilled in the art that the form of the rendering equation as set forth above in equation (15), and the various functions therein, are illustrative of the form and functions that can be used in connection with generation of pixel values to simulate global illumination, and other integral forms and functions will be apparent to those skilled in the art, with corresponding changes particularly in equation (27). For example, the specific form of the integral and various functions therein may differ from that described above if the computer graphics system 10 is to simulate global illumination for, for example, different numbers of dimensions than those contemplated in the formulation above, or if the simulation is to be performed with multiple colors, or if surfaces in the scene are diffuse, glossy or specular (using a so-called “local illumination model”), or if a decision is to be made as to whether to reflect or refit a ray at a particular surface. Although the formulation of the rendering equation and various functions therein may differ in some specific aspects from that described herein, generally, however, the specific rendering equation used therefor will have a form corresponding to that set forth in equation (17) above, and so the computer graphics system 10 can use the strictly deterministic Russian roulette methodology as described above in connection with equations (27) and (28) to evaluate the equation.

As described above in connection with equation (27), generation of an estimator f^((n)) _(RR)(x) for each “x” makes use of a multi-dimensional low-discrepancy sequence (ξ₁ ^((n)), ξ′₁ ^((n)), ξ₂ ^((n)), ξ′₂ ^((n)), . . . , ξ_(L) ^((n)), ξ′_(L) ^((n))). The “unprimed” components ξ₁ ^((n)), . . . ξ_(L) ^((n)) of the sequence are related (reference equation (26)) to the integration over the unprimed variables x₁, x₂, . . . , and the “primed” components ξ′₁ ^((n)), . . . , ξ′_(L) ^((n)) of the sequence are related (reference equation (26)) to the integration over the primed variables x′₁, x′₂, . . . . It will be appreciated by those skilled in the art that, in some circumstances, it may be desirable to use, instead of the “raw” unprimed components ξ₁ ^((n)), . . . , ξ_(L) ^((n)) in generating the estimators f^((n)) _(RR)(x), a selected function or transformation of the components of the sequence in generating the estimators f^((n)) _(RR)(x), which function can be selected to ensure that features in the function K(x,y) will be efficiently captured in the evaluation. It is generally desirable, however, to ensure that the “raw” primed components ξ′₁ ^((n)), . . . , ξ′_(L) ^((n)) are used in generating the estimators f^((n)) _(RR)(x) even if a function or transformation of the unprimed components ξ₁ ^((n)), . . . , ξ_(L) ^((n)) is used.

In addition, although the Halton sequence has been indicated as being used to provide the sample points for the evaluation, it will be appreciated that other low-discrepancy sequences, which are known in the art, could be used instead.

The strictly deterministic Russian roulette methodology, using a strictly-deterministic low-discrepancy sequence such as a multidimensional Hilton sequence, as described above in connection with equations (21) through (28), provides a number of advantages over both a Monte Carlo Russian roulette methodology (that is, a Russian roulette methodology using random numbers), as well as a non-Russian roulette methodology as described above in connection with equations (18) though (20). With respect to a Monte Carlo Russian roulette methodology, as with any other Monte Carlo methodology, such a methodology would use random numbers, and thus would have similar deficiencies as described above. That is, unlike the strictly-deterministic Russian roulette methodology, whose strictly-deterministic low-discrepancy sequence ensures a priori that the sample points will be generally evenly distributed over the multi-dimensional regions over which the estimators are to be evaluated in a low-distributed manner, in comparison to the clumping that can result from random numbers used with a Monte Carlo Russian roulette methodology. Thus, the strictly-deterministic low-discrepancy Russian roulette methodology can require fewer estimators to provide a satisfactory value for the approximation f(x) than would a Monte Carlo Russian roulette methodology.

In addition, unlike the strictly deterministic Russian Roulette methodology, for the non-Russian roulette methodology (equations (18) through (20)), it is generally the case that the Neumann series used to generate each estimator f^((n))(x) (equation (19)) is an infinite series. Accordingly, each such series needs to be truncated at predetermined maximum number of terms, which can result in loss of features in the image. As described above in connection with equations (27) and (28), in the strictly deterministic Russian roulette methodology, for each estimator f^((n)) _(RR)(x), at a particular level “l,” the value of the term of the estimator (equation (27)) for that level and any subsequent levels will be guaranteed to be zero, so that the series is a finite series. Otherwise stated, for the strictly-deterministic Russian roulette methodology, the series (equation (27)) is guaranteed to be self-truncating, whereas for the strictly-deterministic non-Russian roulette methodology, the series (equation (19)) is not generally self-truncating and instead will generally require the computer graphics system 10 to truncate the series. Thus, unlike the strictly-deterministic non-Russian roulette methodology, the strictly-deterministic Russian roulette methodology will ensure that no features of the image will be lost.

In addition, generally with an incite series such as the Neumann series used in connection with the estimators f^((n))(x), the first several terms of the series provide the primary contribution to the resulting value of the estimators f^((n))(x). Because of the self-truncating property, the strictly-deterministic Russian roulette methodology improves on the non-Russian roulette methodology (as described above in connection with equations (18) through (20)) at least for the reason that the first several terms of the Neumann series (which are the most important terms) are taken account in the estimator f^((n))(x) much more often than the following terms of the Neumann series (which are generally less important). Thus, the strictly-deterministic Russian roulette methodology can require fewer estimators to provide a satisfactory value for the approximation f(x) compared to a non-Russian roulette methodology.

Furthermore, since, with the strictly-deterministic Russian roulette methodology, the series for each estimator f^((n)) _(RR)(x) is self-truncating, the methodology allows for an automatic determination of whether or not to terminate a ray path in the global illumination simulation. In both equation (18) and equation (26), each pair (x,x₁), (x₁,x₂), . . . , (x_(i),x_(j)) represents a respective ray path extending from point “x_(j)” to point “x_(i)” in space (to be read from right to left), and, in each estimator, each term represents a contribution of the ray to the global illumination simulation. Since, in the strictly-deterministic Russian roulette methodology, the series used to generate each estimator f^((n)) _(RR)(x) automatically self-truncates, for the pair (x_(i),x_(j)) for which the term is zero, the ray path (x,x₁), (x₁,x₂), . . . , (x_(i),x_(j)) automatically terminates. On the other hand, since, as described above, the strictly-deterministic non-Russian roulette methodology does not automatically terminate, the ray path does not automatically terminate, but instead will be terminated at the point associated with the term for which the series is arbitrarily truncated.

As noted above, the pairs (x,x₁), (x₁,x₂), . . . , (x_(i),x_(j)) represent a respective ray path extending from point “x_(j)” to point “x_(i)” in space. In the strictly-deterministic Russian roulette methodology described above in connection with equations (21) through (28), the ray path is assumed to extend from a light source. An analogous methodology useful in connection with may paths extending from, for example a camera, will be apparent to those skilled in the art.

It will be appreciated that a system in accordance with the invention can be constructed in whole or in part from special purpose hardware or a general purpose computer system, or any combination thereof, any portion of which may be controlled by a suitable program. Any program may in whole or in part comprise part of or be stored on the system in a conventional manner, or it may in whole or in part be provided in to the system over a network or other mechanism for transferring information in a conventional manner. In addition, it will be appreciated that the system may be operated and/or otherwise controlled by means of information provided by an operator using operator input elements (not shown) which may be connected directly to the system or which may transfer the information to the system over a network or other mechanism for transferring information in a conventional manner.

The foregoing description has been limited to a specific embodiment of this invention. It will to be apparent, however, that various variations and modifications may be made to the invention, with the attainment of some or all of the advantages of the invention. It is the object of the appended claims to cover these and such other variations and modifications as come within the true spirit and scope of the invention. 

1. A computer graphics system for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics system generating the pixel value to provide a soft shadow that is represented by an evaluation of an integral of a selected function over a finite extent of a light source, the computer graphics system comprising: A. a sample point generator for generating a set of sample points representing points on the finite extent of the light source, the sample point generator using a predetermined strictly-deterministic low-discrepancy sequence to generate the sample points; B. a function evaluator for generating a plurality of function values each representing an evaluation of said selected function at one of the sample points generated by said sample point generator; C. an illumination value generator for generating an illumination level value for the point in the scene as the average of said function values generated by said function evaluator; and D. a pixel value generator for using the illumination level value generated for the point in the scene in generating the pixel value.
 2. A computer graphics method executable in a computer processor for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics method generating the pixel value to provide a soft shadow that is represented by an evaluation of an integral of a selected function over a finite extent of a light source, the computer graphics method comprising: A. generating, in the computer processor, a set of sample points representing points on the finite extent of the light source using a predetermined strictly-deterministic low-discrepancy sequence; B. generating, in the computer processor, a plurality of function values each representing an evaluation of said selected function at one of the sample points; C. generating, in the computer processor, an illumination level value for the point in the scene as the average of said function values; and D. using, in the computer processor, the illumination level value generated for the point in the scene in generating the pixel value.
 3. A computer graphics system for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics system generating the pixel value to provide a depth of field that is represented by an evaluation of an integral of a selected function over an area of a lens, the computer graphics system comprising: A. a sample point generator for generating a set of sample points representing points on the area of the lens, the sample point generator using a predetermined strictly-deterministic low-discrepancy sequence to generate the sample points; B. a function evaluator for generating a plurality of function values each representing an evaluation of said selected function at one of the sample points generated by said sample point generator; C. a luminance value generator for generating a luminance value for the pixel as the average of said function values generated by said function evaluator; and D. a pixel value generator for using the luminance value generated for the point in the scene in generating the pixel value.
 4. A computer graphics method executable in a computer processor for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics method generating the pixel value to provide a depth of field that is represented by an evaluation of an integral of a selected function over an area of a lens, the computer graphics method comprising: A. generating, in the computer processor, a set of sample points representing points on the area of the lens using a predetermined strictly-deterministic low-discrepancy sequence; B. generating, in the computer processor, a plurality of function values each representing an evaluation of said selected function at one of the sample points; C. generating, in the computer processor, a luminance value for the pixel as the average of said function values; and D. using, in the computer processor, the luminance value generated for the point in the scene in generating the pixel value.
 5. A computer graphics system for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics system generating the pixel value to provide a motion blur that is represented by an evaluation of an integral of a selected function over a selected time interval, the computer graphics system comprising: A. a sample point generator for generating a set of sample points representing points on the time interval, the sample point generator using a predetermined low-discrepancy strictly-deterministic sequence to generate the sample points; B. a function evaluator for generating a plurality of function values each representing an evaluation of said selected function at one of the sample points generated by said sample point generator; C. a luminance value generator for generating a luminance level value for the pixel as the average of said function values generated by said function evaluator; and D. a pixel value generator for using the luminance value generated for the point in the scene in generating the pixel value.
 6. A computer graphics method executable in a computer processor for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the pixel value being generated so as to provide a motion blur that is represented by an evaluation of an integral of a selected function over a selected time interval, the computer graphics method comprising: A. generating, in the computer processor, a set of sample points representing points on the time interval, the sample points being generated using a predetermined strictly-deterministic low-discrepancy sequence; B. generating, in the computer processor, a plurality of function values each representing an evaluation of said selected function at one of the sample points; C. generating, in the computer processor, a luminance level value for the pixel as the average of said function values; and D. using, in the computer processor, the luminance value generated for the point in the scene in generating the pixel value.
 7. A computer graphics system for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the computer graphics system generating the pixel value to provide a jittering that is represented by an evaluation of an integral of a selected function over an area in the image for the pixel, the computer graphics system comprising: A. a sample point generator for generating a set of sample points representing points in a plurality of contiguous pixels in the image, the plurality of contiguous pixels including the pixel for which the pixel value is to be generated, the sample point generator using a predetermined strictly-deterministic low-discrepancy sequence to generate the sample points; B. a function evaluator for generating a plurality of function values each representing an evaluation of said selected function at one of the sample points generated by said sample point generator; C. a pixel value generator for generating the pixel value for the pixel as the average of said function values generated by said function evaluator.
 8. A computer graphics method executable in a computer processor for generating a pixel value for a pixel in an image, the pixel being representative of a point in a scene, the pixel value being generated so as to provide jittering that is represented by an evaluation of an integral of a selected function over an area in the image for the pixel, the computer graphics method comprising: A. generating, in the computer processor, a set of sample points representing points in a plurality of contiguous pixels in the image, the plurality of contiguous pixels including the pixel for which the pixel value is to be generated, the sample points being generated using a predetermined strictly-deterministic low-discrepancy sequence; B. generating, in the computer processor, a plurality of function values each representing an evaluation of said selected function at one of the sample points; and C. generating, in the computer processor, the pixel value for the pixel as the average of said function values. 